Comparative calculation of irrigation networks using Labye's method, the linear programming method and a simplified nonlinear method

نویسندگان

  • M. E. Theocharis
  • C. D. Tzimopoulos
  • M. A. Sakellariou-Makrantonaki
  • S. I. Yannopoulos
  • I. K. Meletiou
چکیده

The designating factors in the design of branched irrigation networks are the cost of pipes and the cost of pumping. They both depend directly on the hydraulic pump head. It is mandatory for this reason to calculate the optimal pump head as well as the corresponding economic pipe diameters, in order the minimal total cost of the irrigation network to be produced. The classical optimization techniques, which have been proposed so long, are the following: the linear programming optimization method, the nonlinear programming optimization method, the dynamic programming optimization method and Labye’s method. The mathematical research of the problem using the above classical optimization techniques is very complex and the numerical solution calls for a lot of calculations, especially in the case of a network with many branches. For this reason, many researchers have developed simplified calculation methods with satisfactory results and with less calculation time needed. A simplified nonlinear optimization method has been developed at the Aristotle University of Thessaloniki — Greece by M. Theocharis. The required calculating procedure is much shorter when using Theocharis’ simplified method than when using the classic optimization methods, because Theocharis’ method requires only a handheld calculator and just a few numerical calculations. In this paper a comparative calculation of the pump optimal head as well as the corresponded economic pipe diameters, using: (a) Labye’s optimization method, (b) the linear programming optimization method and (c) Theocharis’ simplified nonlinear programming method is presented. Application and comparative evaluation in a particular irrigation network is also developed. From the study it is concluded that Theocharis’ simplified method can be equally used with the classical methods. © 2009 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Design of Irrigation Networks Using the Dynamic Method and a Simplified Nonlinear Method

The designating factors in the design of branched irrigation networks are the cost of pipes and the cost of pumping. They both depend directly on the hydraulic head of the pump station. It is mandatory for this reason to calculate the optimal head of the pump station as well as the corresponded optimal pipe diameters, in order to derive the minimal total cost of the irrigation network. The math...

متن کامل

Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints

In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

A Compromise Decision-Making Model Based on TOPSIS and VIKOR for Multi-Objective Large- Scale Nonlinear Programming Problems with A Block Angular Structure under Fuzzy Environment

This paper proposes a compromise model, based on a new method, to solve the multiobjectivelarge scale linear programming (MOLSLP) problems with block angular structureinvolving fuzzy parameters. The problem involves fuzzy parameters in the objectivefunctions and constraints. In this compromise programming method, two concepts areconsidered simultaneously. First of them is that the optimal alter...

متن کامل

Close interval approximation of piecewise quadratic fuzzy numbers for fuzzy fractional program

  The fuzzy approach has undergone a profound structural transformation in the past few decades. Numerous studies have been undertaken to explain fuzzy approach for linear and nonlinear programs. While, the findings in earlier studies have been conflicting, recent studies of competitive situations indicate that fractional programming problem has a positive impact on comparative scenario. We pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical and Computer Modelling

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2010